Improved lower bounds for the capacitated lot sizing problem with setup times
نویسندگان
چکیده
منابع مشابه
A Capacitated Lot Sizing Problem with Stochastic Setup Times
In this paper, we study a Capacitated Lot Sizing Problem with Stochastic Setup Times (CLSP-SST).We describe a mathematical model that considers both regular costs (including production, setup and inventory holding costs) and expected overtime costs (related to the excess usage of capacity). The CLSP-SST is formulated as a two-stage stochastic programming problem. A procedure is proposed to effe...
متن کاملAn MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
This paper considers the capacitated multi-level lot-sizing problem with setup times, a class of difficult problems often faced in practical production planning settings. In the literature, relax-and-fix is a technique commonly applied to solve this problem due to the fact that setup decisions in later periods of the planning horizon are sensitive to setup decisions in the early periods but not...
متن کاملPeriod Decompositions for the Capacitated Lot Sizing Problem with Setup Times
Sizing Problem with Setup Times Silvio Alexandre de Araujo Departamento de Matemática Aplicada, Universidade Estadual Paulista, São José do Rio Preto SP, 15054-000, Brazil [email protected] Bert De Reyck Department of Management Science and Innovation, University College London, WC1E 6BT, UK [email protected] Zeger Degraeve Melbourne Business School, University of Melbourne, Carlton VIC...
متن کاملA Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
We introduce Horizon Decomposition in the context of Dantzig-Wolfe Decomposition, and apply it to the Capacitated Lot-Sizing Problem with Setup Times. We partition the problem horizon in contiguous overlapping intervals and create subproblems identical to the original problem, but of smaller size. The user has the flexibility to regulate the size of the master problem and the subproblem via two...
متن کاملMIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2004
ISSN: 0167-6377
DOI: 10.1016/j.orl.2003.06.001